PRIN 2012 “ Geometric Structures , Combinatorics and their Applications ” Principal Investigator : Guglielmo Lunardon 1 Short
نویسنده
چکیده
The main objective of this Project is to develop and promote basic research in the framework of Incidence Geometries, Galois Geometries and Combinatorics, both through active investigation performed by the involved researchers on subjects of great up-to-date scientific interest and through the organisation of national and international Conferences, Workshops and specialised Schools. Further, special computer algebra software packages will be used, and new subpackages will be written, for studying finite structures. As for applications, joint research will be developed both with researchers, also outside of the academic world, and with public and private research institutions. The main themes are listed below which are relevant to this Project as well as those problems to whose solution significant contributions will hopefully be made.
منابع مشابه
Good eggs and Veronese varieties
We give a new proof of the main theorem of [6] concerning the connection between good eggs in PG(4n− 1, q), q odd, and Veronese varieties, using the model for good eggs in PG(4n − 1, q), q odd, from [2].
متن کاملGeneralizing flocks of Q B ( 3 ; q )
We define flocks of Segre varieties Sn; n as a generalization of flocks of Q þð3; qÞ, studying the connections with translation planes.
متن کاملGeneralized Twisted Gabidulin Codes
Based on the twisted Gabidulin codes obtained recently by Sheekey, we construct a new family of maximal rank distance codes as a set of qpolynomials over Fqn , which includes the generalized Gabidulin codes and the twisted Gabidulin codes. Their Delsarte duals and adjoint codes are investigated. We also obtain necessary and sufficient conditions for the equivalence between two members of our ne...
متن کاملSymplectic Restriction Varieties and Geometric Branching Rules
In this paper, we introduce new, combinatorially defined subvarieties of isotropic Grassmannians called symplectic restriction varieties. We study their geometric properties and compute their cohomology classes. In particular, we give a positive, combinatorial, geometric branching rule for computing the map in cohomology induced by the inclusion i : SG(k, n)→ G(k, n). This rule has many applica...
متن کاملColourings of cubic graphs inducing isomorphic monochromatic subgraphs
A k–bisection of a bridgeless cubic graph G is a 2–colouring of its vertex set such that the colour classes have the same cardinality and all connected components in the two subgraphs induced by the colour classes (monochromatic components in what follows) have order at most k. Ban and Linial conjectured that every bridgeless cubic graph admits a 2–bisection except for the Petersen graph. A sim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015